Fullerenes line up

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Line Up Column Line Up Row DETAILED BUDGET

FRM is an experimental, knowledge-based system that assists in the judgmental aspects of budget planning and financial resource management. Problem solving in this domain requires many kinds of knowledge from many sources. We represent domain knowledge uniformly as constraints and view resource management and planning problems as constraint satisfaction and resolution tasks. We sketch here the ...

متن کامل

From small fullerenes to the graphene limit: A harmonic force-field method for fullerenes and a comparison to density functional calculations for Goldberg-Coxeter fullerenes up to C980

We introduce a simple but computationally very efficient harmonic force field, which works for all fullerene structures and includes bond stretching, bending, and torsional motions as implemented into our open-source code Fullerene. This gives accurate geometries and reasonably accurate vibrational frequencies with root mean square deviations of up to 0.05 Å for bond distances and 45.5 cm(-1) f...

متن کامل

Block line-up

Described is a module for the placement of items either on the same horizontal line or on top of each other. Alignment and separation of the items can be varied in horizontal and vertical direction as required. Titles can be added and their location, style and color speci ied.

متن کامل

Measuring Line-up Fairness

The fairness of line-ups and photospreads is a traditional concern of research and policy development in the area of eyewitness identi®cation. Quanti®cation of fairness, the construction of fairness indices, and the development of evaluation procedures started in the 1970s and continues to this day. This paper reviews the historical development of the ®eld as an introduction to the articles tha...

متن کامل

Bipartizing fullerenes

A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O( √ n) edges. This bound is asymptotically optimal.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Nanotechnology

سال: 2006

ISSN: 1748-3387,1748-3395

DOI: 10.1038/nnano.2006.126